A polynomial projection-type algorithm for linear programming
نویسندگان
چکیده
منابع مشابه
A polynomial projection-type algorithm for linear programming
or show that none exists. The first practical algorithm for linear programming was the simplex method, introduced by Dantzig in 1947 [7]; while efficient in practice, for most known pivoting rules the method has an exponential-time worst case complexity. Several other algorithms were developed over the subsequent decades, such as the relaxation method by Agmon [2] and Motzikin and Shoenberg [13...
متن کاملA polynomial projection algorithm for linear programming
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear equations and non-negativity constraints. Then it uses a procedure that either finds a solution for the respective homogeneous system or provides the information based on which the algorithm rescales the homogeneous system so that its fea...
متن کاملA Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
No part of this report may be reproduced in any form, by print, photoprint, microolm or any other means without written permis
متن کاملA polynomial relaxation-type algorithm for linear programming
The paper proposes a polynomial algorithm for solving systems of linear inequalities. The algorithm uses a polynomial relaxation-type procedure which either finds a solution for Ax = b,0 ≤ x ≤ 1, or decides that the system has no integer solutions. 1 Polynomial algorithm The polynomial algorithm described in [2] either solves a linear system Ax = b,0 ≤ x ≤ 1, or decides that it has no 0,1-solut...
متن کاملA Very Simple Polynomial - Time Algorithm for Linear Programming
In this note we propose a polynomial-time algorithm for linear programming. This algorithm augments the objective by a logarithmic penalty function and then solves a sequence of quadratic approximations of this program. This algorithm has a complexity of O(ml/2 -L) iterations and O(m 3 .5.L) arithmetic operations, where m is the number of variables and L is the size of the problem encoding in b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2014
ISSN: 0167-6377
DOI: 10.1016/j.orl.2013.12.007